Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited
نویسندگان
چکیده
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect to termination proving power, Lucas managed to prove in 2006 that there are rewrite systems that can be shown polynomially terminating by polynomial interpretations with real (algebraic) coefficients, but cannot be shown polynomially terminating using polynomials with rational coefficients only. He also proved the corresponding statement regarding the use of rational coefficients versus integer coefficients. In this article we extend these results, thereby giving the full picture of the relationship between the aforementioned variants of polynomial interpretations. In particular, we show that polynomial interpretations with real or rational coefficients do not subsume polynomial interpretations with integer coefficients. Our results hold also for incremental termination proofs with polynomial interpretations.
منابع مشابه
Implementing field extensions of the form Q [ √ b ] ∗
We apply data refinement to implement the real numbers, where we support all numbers in the field extension Q[ √ b], i.e., all numbers of the form p+ q √ b for rational numbers p and q and some fixed natural number b. To this end, we also developed algorithms to precisely compute roots of a rational number, and to perform a factorization of natural numbers which eliminates duplicate prime facto...
متن کاملPolynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. In 2006, Lucas proved that there are rewrite systems that can be shown polynomially terminating by polynomial interpretations with real (algebraic) coefficients, but cannot be shown polynomially ...
متن کاملUsing Matrix Interpretations over the Reals in Proofs of Termination
Matrix interpretations are a new kind of algebraic interpretations with interesting capabilities for proving termination of rewriting systems. Roughly speaking, a matrix interpretation for a !-ary symbol " is a linear expression #1$1+⋅ ⋅ ⋅+#!$!+#0 where the #1, . . . , #! are matrices of '×' natural numbers and the variables $1, . . . , $! (and also #0) represent '-tuples of natural numbers. In...
متن کاملSearch Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interpretations with polynomials over the naturals. But recently, it was shown that interpretations with polynomials over the rationals can be significantly more powerful. However, searching for such interpretations is cons...
متن کاملPolynomial time computable real functions
In this paper, we study computability and complexity of real functions. We extend these notions, already defined for functions over closed intervals or over the real line to functions over particular real open sets and give some results and characterizations, especially for polynomial time computable functions. Our representation of real numbers as sequences of rational numbers allows us to imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logical Methods in Computer Science
دوره 10 شماره
صفحات -
تاریخ انتشار 2014